Constraint CNF: SAT and CSP Language Under One Roof
نویسندگان
چکیده
A new language, called constraint CNF, is proposed. It integrates propositional logic with constraints stemming from constraint programming. A family of algorithms is designed to solve problems expressed in constraint CNF. These algorithms build on techniques from both propositional satisfiability and constraint programming. The result is a uniform language and an algorithmic framework, which allow us to gain a deeper understanding of the relation between the solving techniques used in propositional satisfiability and in constraint programming and apply them together. 1998 ACM Subject Classification I.2.4 Knowledge Representation Formalisms and Methods
منابع مشابه
Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances
While CNF propositional satisfiability (SAT) is a sub-class of the more general constraint satisfaction problem (CSP), conventional wisdom has it that some well-known CSP look-back techniques -including backjumping and learning -are of little use for SAT. We enhance the Tableau SAT algorithm of Crawford and Auton with look-back techniques and evaluate its performance on problems specifically de...
متن کاملSolving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields. One of these fields is propositional logic and the well-known Max-SAT problem. In this paper, we...
متن کاملThe Order Encoding: From Tractable CSP to Tractable SAT
Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs). The general CSP is known to be NP-complete, but many different conditions have been identified which are sufficient to ensure that classes of instances satisfying those conditions are tractable, that is, solvable in polynomial time [1–4, 7]. The increasing efficiency of SAT-solvers has led to t...
متن کاملThe Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the truth of a logical sentence consisting of a conjunction of constraints, in front of which all variables are existentially quantified. The quantified constraint satisfaction problem (QCSP) is the ge...
متن کاملManaging Multiple Alldifferent Constraints in CSP and SAT
Combinatorial problems are generally modeled as constraint satisfaction problems (CSP) or Boolean satisfiability problem (SAT). Modeling and resolution of CSP is often strenghtened by global constraints (e.g., Alldiff constraint) whereas no such high level feature is offered in SAT. In this paper, we propose a uniform propagation framework to handle Alldiff constraints (possibly interleaved) wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016